Smooth Entropy and Rényi Entropy

The notion of smooth entropy allows a unifying, generalized formulation of privacy ampli-cation and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the R enyi entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other hand, an assumption about Shannon entropy (which is R enyi entropy of order 1) is too weak to guarantee any non-trivial amount of smooth entropy. In this work we close the gap between R enyi entropy of order 1 and 2. In particular, we show that R enyi entropy of order for any 1 < < 2 is a lower bound for smooth entropy, up to a small parameter depending on , the alphabet size and the failure probability. The results have applications in cryptography for unconditionally secure protocols such as quantum key agreement, key agreement from correlated information, oblivious transfer, and bit commitment.